Working with Schemas, Predicting with Schemas

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conceptual Schemas with Abstractions: Making Flat Conceptual Schemas More Comprehensible

Conceptual Schemas with Abstractions – Making flat conceptual schemas more comprehensi-ble, L. Abstract Flat graphical, conceptual modeling techniques are widely accepted as visually effective ways in which to specify and communicate the conceptual data requirements of an information system. Conceptual schema diagrams provide modelers with a picture of the salient structures underlying the mode...

متن کامل

Querying Schemas With Access Restrictions

We study verification of systems whose transitions consist of accesses to a Web-based data-source. An access is a lookup on a relation within a relational database, fixing values for a set of positions in the relation. For example, a transition can represent access to a Web form, where the user is restricted to filling in values for a particular set of fields. We look at verifying properties of...

متن کامل

Matching of XML Schemas and Relational Schemas

XML is widely used for data exchange between relational databases. Generic exchange tools are based on mappings between the elements of both schemas. Despite the benefits of using generic tools, the manual definition of the mappings can become a time consuming and error-prone task. Given this scenario we propose algorithms for the automatic matching of XML schemas(DTDs) and relational schemas. ...

متن کامل

Ensuring Query Compatibility with Evolving XML Schemas

During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data. Nowadays, a challenge is to assess and accommodate the impact of theses changes in rapidly evolving XML applications. This article proposes a logical framework and tool for verifying forward/backwa...

متن کامل

A Analysis of Schemas With Access Restrictions

We study verification of systems whose transitions consist of accesses to a Web-based data-source. An access is a lookup on a relation within a relational database, fixing values for a set of positions in the relation. For example, a transition can represent access to a Web form, where the user is restricted to filling in values for a particular set of fields. We look at verifying properties of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Neuroscience

سال: 2018

ISSN: 0270-6474,1529-2401

DOI: 10.1523/jneurosci.3281-17.2018